The computational power of matchgates and the XY interaction on arbitrary graphs
نویسندگان
چکیده
Daniel J. Brod 2, ∗ and Andrew M. Childs 3, † Instituto de F́ısica, Universidade Federal Fluminense, Av. Gal. Milton Tavares de Souza s/n, Gragoatá, Niterói, RJ, 24210-340, Brazil Institute for Quantum Computing, University of Waterloo, 200 University Ave. W., Waterloo, ON, N2L 3G1, Canada Department of Combinatorics & Optimization, University of Waterloo, 200 University Ave. W., Waterloo, ON, N2L 3G1, Canada (Dated: August 8, 2013)
منابع مشابه
On zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملMatchgate and space-bounded quantum computations are equivalent
Matchgates are an especially multiflorous class of two-qubit nearest neighbour quantum gates, defined by a set of algebraic constraints. They occur for example in the theory of perfect matchings of graphs, non-interacting fermions, and one-dimensional spin chains. We show that the computational power of circuits of matchgates is equivalent to that of space-bounded quantum computation with unita...
متن کاملFurther results on total mean cordial labeling of graphs
A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...
متن کاملComputational Study of Chemical Properties of Xylometazoline and the Connected form to Fullerene (C60) as a Medicine Nano Carrier
In this research at the first, xylometazoline hydrochloride drug (XY) and its fullerene connected form (FXY) were optimized. Natural Bond Orbital (NBO) calculations for these compounds were carried out at the B3LYP/6-31G* quantum chemistry level, in the gas phase and the liquid phase. These calculations can be performed at different accuracy levels depending on the aim of the theoretical study....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 14 شماره
صفحات -
تاریخ انتشار 2014